Trapezoidal lattice paths and multivariate analogues

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Staircase Tilings and Lattice Paths

We define a combinatorial structure, a tiling of the staircase in the R plane, that will allow us, when restricted in different ways, to create direct bijections to Dyck paths of length 2n, Motzkin paths of lengths n and n−1, as well as Schröder paths and little Schröder paths of length n.

متن کامل

Lattice Paths and Rogers Identities

Recently we interpreted five q-series identities of Rogers combinatorially by using partitions with “n + t copies of n” of Agarwal and Andrews [1]. In this paper we use lattice paths of Agarwal and Bressoud [2] to provide new combinatorial interpretations of the same identities. This results in five new 3-way combinatorial identities.

متن کامل

Jagged partitions and lattice paths

A lattice-path description of K-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even x coordinate and the maximal value of the height cannot be larger than K − 1. Its weight is twice that of the corresponding jagged partitions. The equivalence is demonstrated at the level of generating functions. A bijection is given between K-restricted jagged ...

متن کامل

Lattice paths and random walks

Lattice paths are ubiquitous in combinatorics and algorithmics, where they are either studied per se, or as a convenient encoding of other structures. Logically, they play an important role in Philippe’s papers. For instance, they are central in his combinatorial theory of continued fractions, to which Chapter 3 of this volume is devoted. In this chapter, we present a collection of seven papers...

متن کامل

Lattice Paths and Faber Polynomials

The rth Faber polynomial of the Laurent series f(t) = t + f0 + f1/t + f2/t + · · · is the unique polynomial Fr(u) of degree r in u such that Fr(f) = tr + negative powers of t. We apply Faber polynomials, which were originally used to study univalent functions, to lattice path enumeration.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2003

ISSN: 0196-8858

DOI: 10.1016/s0196-8858(03)00028-9